Parallel image restoration using surrogate constraint methods
نویسندگان
چکیده
منابع مشابه
Parallel image restoration using surrogate constraint methods
When formulated as a system of linear inequalities, the image restoration problem yields huge, unstructured, sparse matrices even for images of small size. To solve the image restoration problem, we use the surrogate constraint methods that can work efficiently for large problems. Among variants of the surrogate constraint method, we consider a basic method performing a single block projection ...
متن کاملImage Restoration Using A PDE-Based Approach
Image restoration is an essential preprocessing step for many image analysis applications. In any image restoration techniques, keeping structure of the image unchanged is very important. Such structure in an image often corresponds to the region discontinuities and edges. The techniques based on partial differential equations, such as the heat equations, are receiving considerable attention i...
متن کاملIterative Methods for Image Restoration
Although image restoration methods based on spectral filtering techniques are very efficient, they can be applied only to problems with fairly simple spatially invariant blurring operators. Iterative methods, however, are much more flexible; they can be very efficient for spatially invariant as well as spatially variant blurs, they can incorporate a variety of regularization techniques and boun...
متن کاملPartitioned Separable Paraboloidal Surrogate Coordinate Ascent Algorithm for Image Restoration
We introduce a new fast converging parallelizable algorithm for image restoration. This algorithm is based on paraboloidal surrogate functions to simplify the optimization problem and a concavity technique developed by De Pierro to simultaneously update a set of pixels. To obtain large step sizes which affect the convergence rate, we choose the paraboloidal surrogate functions that have small c...
متن کاملParallel Image Restoration with Domain Decomposition
In this paper we present parallel algorithms to solve the problem of image restoration when the Point Spread Function is Space Variant. The problem has a very high computational complexity and it is very hard to solve it on scalar computers. The algorithms are based on the decomposition of the image spatial domain and on the solution of both constrained and uncostrained restoration subproblems ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Parallel and Distributed Computing
سال: 2007
ISSN: 0743-7315
DOI: 10.1016/j.jpdc.2006.10.001